Results![]()
A variety of different experiments were performed to determine the strengths and limitations of our system. Additional
effort was focused on improving the squared error and handling target movement during the collection of the
projections. Each of the following sections addresses the results of these efforts.
In all of the following images, any speckle noise is the result of artifacts during the conversion from MATLAB's image
display to the GIF image file format used on these pages. A lack of available colors resident in the
computer's graphics table, image scaling, and the file format itself produces these artifacts.
Case I
The first experiment was to determine the performance of our algorithm under three variables: number of projection angles, detector length, and number of detectors. The following
reconstructed images represent a good sampling to demonstrate the strengths and weaknesses of the methodology. The squared error (SE) is also listed to give a quantitative comparison, along with the qualitative differences shown in the reconstructed images. The phantom image from which the reconstructions were made is shown at the top of Fig. 5.1. All reconstructed images for this experiment used the fftfilter.m in the backproj.m function.
![]()
algorithm using the labeled number of projection angles, detector length, and number of detectors. Squared error (SE) is also listed.
First inspection of the reconstructed images noted that some parts of the background have negative values. Although most of these values were small, this implies that a detector could receive a negative quantity of x-rays. Logically this does not make sense. The cause of the negative values comes from computational roundoff, and Gibb's phenomenon in the discrete Fourier transform filtering (fftfilter.m). Removal of the negative values is reasonable since the difference between the background and any actual mass between the source and detectors is relatively large. An effort to remove the negative values should not disturb any real structure we want to observe. A simple program, zeroneg.m, was used to change all negative values to zero. The results are shown in Fig. 5.2.
before and after changing all negative values to zero. Squared error (SE) is also listed.
In this experiment, reconstructed images similar to Case I were obtained using the convolution back-projection algorithm (i.e., using convfilter.m instead of fftfilter.m).
instead of the FFT based reconstruction algorithm using the labeled number of projection angles, detector length, and number of detectors. Squared error is also listed, along with the squared error from Case I shown in ().
1. The sampling density of the projection is larger in this case than for a detector length of
The same is not observed, however, when the FFT based filter is
used. This is due to the following difference in their
implementation. In the FFT based implementation, the filtered
projection is restricted to the same length as the projection. In the
convolution based implementation, the filtered projection is longer
than the projection. Due to this difference, the portions of the image
that are not within the detector (the areas near the four corners of
the image) are not reconstructed properly in the FFT based
implementation but reconstructed well in the convolution based
implementation. The top two corners are reconstructed well in both
methods since most of the back-projection values for them will be
zero. However, the bottom two corners contribute to most of the error
in the FFT based implementation.
The following squared error images illustrate this.
Total squared error (SE) is also listed.
In this experiment, we simulate the effect of shifts in the entire image and growth in specific regions like the lungs and heart. These changes occur during the process of determining the projections. In the specific simulation results shown, the shift, grow_lng or grow_hrt parameter used in project.m is modified halfway through the process of determining the projections.
or growth of regions, occurring halfway through the process of determining the projections. Number of projection angles = 400. Number of detectors = 500. Detector length = 1.5. The shift and growth parameters were changed after 200 projections were obtained.
during the collection of projections (using shiftfix.m). Note the artifacts near the spinal column.
This section contains the results from our attempts at image enhancement. Six images were used and are listed below in Table 5.1. All reconstructed images for this experiment used the fftfilter.m in the backproj.m function. Each row corresponds to a different filter, described in the image enhancement section. The metric used to determine image quality was the total squared error between each reconstructed and filtered pixel and the corresponding original image pixels.
wavelet transform edge thinning algorithm.
After looking at the variety of outcomes from the above experiments, we applied our best algorithms to a single reconstruction. The final reconstructed image was generated using 400 projection angles, a length one detector, and 500 detectors on the array. We used the convolution back-projection to filter the projections. After the image was formed, post-processing algorithms included both zeroneg.m and median filtering. The final squared error was 9.61.
along with plots of the error locations.
|